TSTP Solution File: ITP163^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP163^1 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:07:11 EDT 2024
% Result : Theorem 0.41s 0.65s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 26 ( 5 unt; 9 typ; 0 def)
% Number of atoms : 39 ( 0 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 116 ( 14 ~; 12 |; 3 &; 83 @)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 16 ( 0 ^ 16 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
refine424419629nres_a: $tType ).
thf(decl_sort2,type,
set_a: $tType ).
thf(decl_sort3,type,
a: $tType ).
thf(decl_37,type,
refine1312857699nres_a: refine424419629nres_a > a > $o ).
thf(decl_40,type,
refine1198353288_RES_a: set_a > refine424419629nres_a ).
thf(decl_42,type,
collect_a: ( a > $o ) > set_a ).
thf(decl_47,type,
member_a: a > set_a > $o ).
thf(decl_48,type,
phi: a > $o ).
thf(decl_49,type,
x: a ).
thf(conj_0,conjecture,
( ( refine1312857699nres_a @ ( refine1198353288_RES_a @ ( collect_a @ phi ) ) @ x )
<=> ( phi @ x ) ),
file('/export/starexec/sandbox2/tmp/tmp.URdQsPGvNp/E---3.1_22450.p',conj_0) ).
thf(fact_2_nf__inres__RES,axiom,
! [X1: set_a,X5: a] :
( ( refine1312857699nres_a @ ( refine1198353288_RES_a @ X1 ) @ X5 )
<=> ( member_a @ X5 @ X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.URdQsPGvNp/E---3.1_22450.p',fact_2_nf__inres__RES) ).
thf(fact_41_mem__Collect__eq,axiom,
! [X56: a,X57: a > $o] :
( ( member_a @ X56 @ ( collect_a @ X57 ) )
<=> ( X57 @ X56 ) ),
file('/export/starexec/sandbox2/tmp/tmp.URdQsPGvNp/E---3.1_22450.p',fact_41_mem__Collect__eq) ).
thf(c_0_3,negated_conjecture,
~ ( ( refine1312857699nres_a @ ( refine1198353288_RES_a @ ( collect_a @ phi ) ) @ x )
<=> ( phi @ x ) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_4,plain,
! [X1186: set_a,X1187: a] :
( ( ~ ( refine1312857699nres_a @ ( refine1198353288_RES_a @ X1186 ) @ X1187 )
| ( member_a @ X1187 @ X1186 ) )
& ( ~ ( member_a @ X1187 @ X1186 )
| ( refine1312857699nres_a @ ( refine1198353288_RES_a @ X1186 ) @ X1187 ) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_2_nf__inres__RES])]) ).
thf(c_0_5,negated_conjecture,
( ( ~ ( refine1312857699nres_a @ ( refine1198353288_RES_a @ ( collect_a @ phi ) ) @ x )
| ~ ( phi @ x ) )
& ( ( refine1312857699nres_a @ ( refine1198353288_RES_a @ ( collect_a @ phi ) ) @ x )
| ( phi @ x ) ) ),
inference(fof_nnf,[status(thm)],[c_0_3]) ).
thf(c_0_6,plain,
! [X1257: a,X1258: a > $o] :
( ( ~ ( member_a @ X1257 @ ( collect_a @ X1258 ) )
| ( X1258 @ X1257 ) )
& ( ~ ( X1258 @ X1257 )
| ( member_a @ X1257 @ ( collect_a @ X1258 ) ) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_41_mem__Collect__eq])]) ).
thf(c_0_7,plain,
! [X1: set_a,X5: a] :
( ( member_a @ X5 @ X1 )
| ~ ( refine1312857699nres_a @ ( refine1198353288_RES_a @ X1 ) @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
( ( refine1312857699nres_a @ ( refine1198353288_RES_a @ ( collect_a @ phi ) ) @ x )
| ( phi @ x ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,plain,
! [X57: a > $o,X5: a] :
( ( member_a @ X5 @ ( collect_a @ X57 ) )
| ~ ( X57 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
! [X5: a,X57: a > $o] :
( ( X57 @ X5 )
| ~ ( member_a @ X5 @ ( collect_a @ X57 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_11,negated_conjecture,
member_a @ x @ ( collect_a @ phi ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
thf(c_0_12,negated_conjecture,
( ~ ( refine1312857699nres_a @ ( refine1198353288_RES_a @ ( collect_a @ phi ) ) @ x )
| ~ ( phi @ x ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_13,negated_conjecture,
phi @ x,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_14,negated_conjecture,
~ ( refine1312857699nres_a @ ( refine1198353288_RES_a @ ( collect_a @ phi ) ) @ x ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
thf(c_0_15,plain,
! [X5: a,X1: set_a] :
( ( refine1312857699nres_a @ ( refine1198353288_RES_a @ X1 ) @ X5 )
| ~ ( member_a @ X5 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.16 % Problem : ITP163^1 : TPTP v8.1.2. Released v7.5.0.
% 0.12/0.17 % Command : run_E %s %d THM
% 0.18/0.38 % Computer : n007.cluster.edu
% 0.18/0.38 % Model : x86_64 x86_64
% 0.18/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.38 % Memory : 8042.1875MB
% 0.18/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.38 % CPULimit : 300
% 0.18/0.38 % WCLimit : 300
% 0.18/0.38 % DateTime : Fri May 3 11:59:50 EDT 2024
% 0.18/0.39 % CPUTime :
% 0.39/0.55 Running higher-order theorem proving
% 0.39/0.55 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.URdQsPGvNp/E---3.1_22450.p
% 0.41/0.65 # Version: 3.1.0-ho
% 0.41/0.65 # Preprocessing class: HSLSSMSSSSSCHSA.
% 0.41/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.65 # Starting new_ho_10 with 1500s (5) cores
% 0.41/0.65 # Starting sh5l with 300s (1) cores
% 0.41/0.65 # Starting new_bool_1 with 300s (1) cores
% 0.41/0.65 # Starting new_bool_2 with 300s (1) cores
% 0.41/0.65 # new_bool_2 with pid 22623 completed with status 0
% 0.41/0.65 # Result found by new_bool_2
% 0.41/0.65 # Preprocessing class: HSLSSMSSSSSCHSA.
% 0.41/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.65 # Starting new_ho_10 with 1500s (5) cores
% 0.41/0.65 # Starting sh5l with 300s (1) cores
% 0.41/0.65 # Starting new_bool_1 with 300s (1) cores
% 0.41/0.65 # Starting new_bool_2 with 300s (1) cores
% 0.41/0.65 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.41/0.65 # Search class: HGHSM-FSLM33-DHSFFSBN
% 0.41/0.65 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.41/0.65 # Starting sh3 with 163s (1) cores
% 0.41/0.65 # sh3 with pid 22642 completed with status 0
% 0.41/0.65 # Result found by sh3
% 0.41/0.65 # Preprocessing class: HSLSSMSSSSSCHSA.
% 0.41/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.65 # Starting new_ho_10 with 1500s (5) cores
% 0.41/0.65 # Starting sh5l with 300s (1) cores
% 0.41/0.65 # Starting new_bool_1 with 300s (1) cores
% 0.41/0.65 # Starting new_bool_2 with 300s (1) cores
% 0.41/0.65 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.41/0.65 # Search class: HGHSM-FSLM33-DHSFFSBN
% 0.41/0.65 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.41/0.65 # Starting sh3 with 163s (1) cores
% 0.41/0.65 # Preprocessing time : 0.007 s
% 0.41/0.65 # Presaturation interreduction done
% 0.41/0.65
% 0.41/0.65 # Proof found!
% 0.41/0.65 # SZS status Theorem
% 0.41/0.65 # SZS output start CNFRefutation
% See solution above
% 0.41/0.65 # Parsed axioms : 304
% 0.41/0.65 # Removed by relevancy pruning/SinE : 65
% 0.41/0.65 # Initial clauses : 434
% 0.41/0.65 # Removed in clause preprocessing : 72
% 0.41/0.65 # Initial clauses in saturation : 362
% 0.41/0.65 # Processed clauses : 452
% 0.41/0.65 # ...of these trivial : 14
% 0.41/0.65 # ...subsumed : 114
% 0.41/0.65 # ...remaining for further processing : 324
% 0.41/0.65 # Other redundant clauses eliminated : 54
% 0.41/0.65 # Clauses deleted for lack of memory : 0
% 0.41/0.65 # Backward-subsumed : 0
% 0.41/0.65 # Backward-rewritten : 5
% 0.41/0.65 # Generated clauses : 102
% 0.41/0.65 # ...of the previous two non-redundant : 83
% 0.41/0.65 # ...aggressively subsumed : 0
% 0.41/0.65 # Contextual simplify-reflections : 9
% 0.41/0.65 # Paramodulations : 41
% 0.41/0.65 # Factorizations : 0
% 0.41/0.65 # NegExts : 3
% 0.41/0.65 # Equation resolutions : 55
% 0.41/0.65 # Disequality decompositions : 0
% 0.41/0.65 # Total rewrite steps : 31
% 0.41/0.65 # ...of those cached : 17
% 0.41/0.65 # Propositional unsat checks : 0
% 0.41/0.65 # Propositional check models : 0
% 0.41/0.65 # Propositional check unsatisfiable : 0
% 0.41/0.65 # Propositional clauses : 0
% 0.41/0.65 # Propositional clauses after purity: 0
% 0.41/0.65 # Propositional unsat core size : 0
% 0.41/0.65 # Propositional preprocessing time : 0.000
% 0.41/0.65 # Propositional encoding time : 0.000
% 0.41/0.65 # Propositional solver time : 0.000
% 0.41/0.65 # Success case prop preproc time : 0.000
% 0.41/0.65 # Success case prop encoding time : 0.000
% 0.41/0.65 # Success case prop solver time : 0.000
% 0.41/0.65 # Current number of processed clauses : 36
% 0.41/0.65 # Positive orientable unit clauses : 11
% 0.41/0.65 # Positive unorientable unit clauses: 0
% 0.41/0.65 # Negative unit clauses : 6
% 0.41/0.65 # Non-unit-clauses : 19
% 0.41/0.65 # Current number of unprocessed clauses: 224
% 0.41/0.65 # ...number of literals in the above : 668
% 0.41/0.65 # Current number of archived formulas : 0
% 0.41/0.65 # Current number of archived clauses : 236
% 0.41/0.65 # Clause-clause subsumption calls (NU) : 11763
% 0.41/0.65 # Rec. Clause-clause subsumption calls : 7304
% 0.41/0.65 # Non-unit clause-clause subsumptions : 102
% 0.41/0.65 # Unit Clause-clause subsumption calls : 56
% 0.41/0.65 # Rewrite failures with RHS unbound : 0
% 0.41/0.65 # BW rewrite match attempts : 13
% 0.41/0.65 # BW rewrite match successes : 2
% 0.41/0.65 # Condensation attempts : 0
% 0.41/0.65 # Condensation successes : 0
% 0.41/0.65 # Termbank termtop insertions : 34812
% 0.41/0.65 # Search garbage collected termcells : 9614
% 0.41/0.65
% 0.41/0.65 # -------------------------------------------------
% 0.41/0.65 # User time : 0.061 s
% 0.41/0.65 # System time : 0.011 s
% 0.41/0.65 # Total time : 0.072 s
% 0.41/0.65 # Maximum resident set size: 4176 pages
% 0.41/0.65
% 0.41/0.65 # -------------------------------------------------
% 0.41/0.65 # User time : 0.072 s
% 0.41/0.65 # System time : 0.014 s
% 0.41/0.65 # Total time : 0.086 s
% 0.41/0.65 # Maximum resident set size: 2476 pages
% 0.41/0.65 % E---3.1 exiting
% 0.41/0.66 % E exiting
%------------------------------------------------------------------------------